A Local Limit Theorem for Nonlattice Multi-Dimensional Distribution Functions

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Local Limit Theorem: A Historical Perspective

The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...

متن کامل

A Central Limit Theorem for Belief Functions

The purpose of this Note is to prove a form of CLT (Theorem 1.4) that is used in Epstein and Seo (2011). More general central limit results and other applications will follow in later drafts. Let S = fB;Ng and K (S) = ffBg; fNg; fB;Ngg the set of nonempty subsets of S. Denote by s1 = (s1; s2; :::) the generic element of S1 and by n (s1) the empirical frequency of the outcome B in the …rst n exp...

متن کامل

A Local Limit Theorem for Stationary Processes in the Domain of Attraction of a Normal Distribution

We prove local limit theorems for Gibbs-Markov processes in the domain of attraction of normal distributions. x1 Introduction It is well known that a random variable X belongs to the domain of attraction of a normal distribution DA(2) if its characteristic function satisses () log E exppitX] = itt ? 1 2 t 2 L(1=jtj) for some slowly varying function L : R + ! R + which is bounded below and some ...

متن کامل

A local Tb Theorem for square functions

We prove a “local” Tb Theorem for square functions, in which we assume only Lq control of the pseudo-accretive system, with q > 1. We then give an application to variable coefficient layer potentials for divergence form elliptic operators with bounded measurable non-symmetric coefficients.

متن کامل

A local limit theorem for QuickSort key comparisons via multi-round smoothing

It is a well-known result, due independently to Régnier [8] and Rösler [10], that the number of key comparisons required by the randomized sorting algorithm QuickSort to sort a list of n distinct items (keys) satisfies a global distributional limit theorem. We resolve an open problem of Fill and Janson from 2002 by using a multi-round smoothing technique to establish the corresponding local lim...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1965

ISSN: 0003-4851

DOI: 10.1214/aoms/1177700165